#include<iostream>
using namespace std;

int inArr[10],inArrLen,count=0,res[100][10],used[10];

void print(){

}

int dfs(int cur,int num){
    if(cur == num) {
        print();
        return 1;
        }
    for (int i = 0; i <inArrLen ; i++)
    {
        if(used[i])continue;
        used[i]=1;
        res[count][cur] = i;
        count += dfs(cur+1,num);
        used[i]=0;
    }
    return 0;
}

int main(){

}